Capacities: From information theory to extremal set theory

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacities: From Information Theory to Extremal Set Theory

Generalizing the concept of zero{error capacity beyond its traditional links to any sort of information transmission we give an asymptotic solution to several hard problems in extremal set theory within a uniied, formally information{theoretic framework. The results include the solution of far{reaching generalizations of R enyi's problem on qualitatively independent partitions.

متن کامل

Probabilistic Methods in Extremal Finite Set Theory

There are many known applications of the Probabilistic Method in Extremal Finite Set Theory. In this paper we describe several examples, demonstrating some of the techniques used and illustrating some of the typical results obtained. This is partly a survey paper, but it also contains various new results. ∗Research supported in part by a United States Israel BSF Grant and by a Bergmann Memorial...

متن کامل

Mindfulness from theory to therapy

Mindfulness-based cognitive therapy involves, components of Beck cognitive therapy and mindfulness-based stress reduction therapy provided by Kabat-Zinn and in a therapy group to work with persons with a history of depression and thus vulnerable period later developed.This training of people to broaden their perspective to see maladaptive thoughts, ruminations thought processes and cognitive im...

متن کامل

Freiman's Theorem in Finite Fields via Extremal Set Theory

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman’s theorem in Fn2 : if A ⊆ Fn2 is a set for which |A + A| 6 K|A| then A is contained in a subspace of size 2 √ K log K)|A|; except for the O( √ K logK) error, this is best possible. If in addition we assume that A is a downset, then we can als...

متن کامل

Laver Tables: from Set Theory to Braid Theory

Laver tables An are certain finite shelves (i.e., sets endowed with a binary operation distributive with respect to itself). They originate from Set Theory and, in spite of an elementary definition, have complicated combinatorial properties. They are conjectured to approximate the free monogenerated shelf F1, this conjecture being currently proved only under a large cardinal axiom. This talk is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1994

ISSN: 0097-3165

DOI: 10.1016/0097-3165(94)90108-2